Open source implementation of the Multiplicatively Weighted Voronoi Diagram as a TerraView plugin
نویسندگان
چکیده
Given a point set the Voronoi diagram associates to each point all the locations in a plane that are closer to it . This diagram is often used in spatial analysis to divide an area among points. In the ordinary Voronoi diagram the points are treated as equals and the division is done in a purely geometrical way. A weighted Voronoi diagram is defined as an extension of the original diagram. The weight given usually relates to some variable property of the phenomenon represented by each point. The weighted distance is then computed as a function that depends both on the weight and on the euclidean distance. This article describes a multiplicatively weighted Voronoi diagram implementation as an open source plugin for TerraView. The algorithm used computes an approximation of the diagram using multipolygons to represent each point’s area. This choice avoids the voids that might appear in most of the implementations that focus on finding the intersections and scales well in memory.
منابع مشابه
Generating and updating multiplicatively weighted Voronoi diagrams for point, line and polygon features in GIS
A Voronoi diagram is an interdisciplinary concept that has been applied to many fields. In geographic information systems (GIS), existing capabilities for generating Voronoi diagrams normally focus on ordinary (not weighted) point (not linear or area) features. For better integration of Voronoi diagram models and GIS, a raster-based approach is developed, and implemented seamlessly as an ArcGIS...
متن کاملInteractive Analysis Using Voronoi Diagrams: Algorithms to Support Dynamic Update from a Generic Triangle-based Data Structure
This paper describes a series of dynamic update methods that can be applied to a family of Voronoi diagram types, so that changes can be updated incrementally, without the usual recourse to complete reconstruction of their underlying data structure. More efficient incremental update methods are described for the ordinary Voronoi diagram, the farthest-point Voronoi diagram, the order-k Voronoi d...
متن کاملSpace Allocation of Educational Centers Using Multiplicatively Weighted Voronoi Diagram
The main problem of educational centers in a mega city like Tehran, capital of Iran, is that no enforced service areas exist to guide school selection or allow students to make the most convenient commutes to the nearest schools. Without the defined school service areas, parents seeking better and more reputable schools often have no choice but to send children to schools outside the local area...
متن کاملWeight-proportional Information Space Partitioning Using Adaptive Multiplicatively-Weighted Voronoi Diagrams
We define the spatial constraints and objective function for weight-proportional partitioning of information spaces. We evaluate existing methods in light of these definitions and find that none performs as desired. We then formulate an alternative approach based on an adaptive version of the multiplicatively weighted Voronoi diagram; i.e., the diagram’s weights are computed based on a set of p...
متن کاملMesh Coarsening based upon Multiplicatively Weighted Centroidal Voronoi Diagrams
An approximated Centroidal Voronoi Diagram (CVD) construction provides an efficient and fast way for coarsening polygonal meshes. In this article a new generalization of the CVD for 3D meshes is presented a Multiplicatively Weighted Centroidal Voronoi Diagram. Based on this concept we propose a mesh coarsening algorithm which is intended to capture the mesh features as good as possible. To achi...
متن کامل